Optimal shortening of uniform covering arrays
نویسندگان
چکیده
منابع مشابه
Optimal shortening of uniform covering arrays
Software test suites based on the concept of interaction testing are very useful for testing software components in an economical way. Test suites of this kind may be created using mathematical objects called covering arrays. A covering array, denoted by CA(N; t, k, v), is an N × k array over [Formula: see text] with the property that every N × t sub-array covers all t-tuples of [Formula: see t...
متن کاملOptimal Shortening of Covering Arrays
A Covering Array (CA), denoted by CA(N ; t, k, v), is a matrix of size N×k with entries from the set {0, 1, 2, ..., v−1}, where in each submatrix of size N×t appears each combination of symbols derived from v, at least once. The Covering Arrays (CAs) are combinatorial structures that have applications in software testing. This paper defines the Problem of Optimal Shortening of Covering ARrays (...
متن کاملMixed Covering Arrays on 3-Uniform Hypergraphs
Covering arrays are combinatorial objects that have been successfully applied in the design of test suites for testing systems such as software, circuits and networks, where failures can be caused by the interaction between their parameters. In this paper, we perform a new generalization of covering arrays called covering arrays on 3-uniform hypergraphs. Let n, k be positive integers with k ≥ 3...
متن کاملProfiles of covering arrays of strength two
Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques c...
متن کاملprofiles of covering arrays of strength two
covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. while numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. random generation techniques c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2017
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0189283